Study of Optimal Path Finding Techniques

Routing is a process of forwarding the data from a known source to the destination. In this process, the data may travel through several intermediate paths, and there exist a need to select the best possible optimal nodes to forward the data. This optimal selection of nodes will enable to achieve a high performance in the network. Large amount of worked has been carried out to find the optimal path in the network routing to improve its efficiency and to remove congestion problems. A good routing algorithm should be able to find an optimal path and it must be simple. It also must have low overhead, and be robust and stable, converging rapidly, and must remain flexible. There exists a lot of routing algorithm which have been developed for specific kind of network as well as for general routing purpose. In this paper, I studied some of the best optimal path techniques.